package leetcode.medium.limit100;

/**
 * @author yaoyao1.liu@zhaopin.com.cn
 * @since 2022-11-10 14:42
 **/
public class No62 {

    public static void main(String[] args) {
        No62 no62 = new No62();
        int i = no62.uniquePaths(7, 6);
        System.out.println(i);

    }
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        for (int i = 0; i < n; i++) dp[0][i] = 1;
        for (int i = 0; i < m; i++) dp[i][0] = 1;
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        return dp[m - 1][n - 1];
    }

}
